DYNAMIC CONSEQUENCE AND PUBLIC ANNOUNCEMENT
نویسندگان
چکیده
منابع مشابه
Dynamic Consequence and Public announcement
In [25] van Benthem proposes a dynamic consequence relation defined as ψ1, . . . , ψn |= φ iff |= [ψ1]...[ψn]φ, where the latter denotes consequence in public announcement logic, a dynamic epistemic logic. In this paper we investigate the structural properties of a conditional dynamic consequence relation |=Γ extending van Benthem’s proposal. It takes into account a set of background conditions...
متن کاملCoalitional Public Announcement Games
Dynamic epistemic logic (DEL) is a popular framework for studying interaction in multi-agent systems. DELs describe the actions available to the agents, and their epistemic preand post-conditions. By extending standard epistemic models with preferences over epistemic states, we can say something about rational behaviour as well, combining logic and game theory. In this paper we assume that pref...
متن کاملGeometric Public Announcement Logics
In this paper, we consider public announcement logic (PAL, henceforth) in several different geometric models, and prove its completeness of those models. Moreover, we also consider some applications of our ideas in different fields varying from game theory to epistemic logic. What makes our work novel is the fact that PAL has never been investigated in geometric and topological models with furt...
متن کاملBilattice Public Announcement Logic
Building on recent work on bilattice modal logic and extensions of public announcement logic to a non-classical setting, we introduce a dynamic epistemic logic having the logic of modal bilattices as propositional support. Bilattice logic is both inconsistency-tolerant and paracomplete, thus suited for applications in contexts with multiple sources of information, where one may have to deal wit...
متن کاملTableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In this article we propose a labelled tableau calculus for this logic, and show that it decides satisfiability of formulas in deterministic polynomial space. Since this problem is known to be PSPACE-complete, it follows that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2013
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s1755020313000294